package com.zang.array;

/**
 * @Author: ZVerify
 * @Description: https://leetcode.cn/problems/minimum-size-subarray-sum/
 * @DateTime: 2022/10/4 10:48
 **/
public class 长度最小的子数组 {

    // medium

    /**
     * 使用滑动窗口解决
     */

    public int minSubArrayLen(int target, int[] nums) {

        int i = 0;

        int result = Integer.MAX_VALUE;

        for (int j = 0;j < nums.length;j++){

        }
        return 1;
    }
}
